Call Graph-Directed Boundary Condition Analysis in Contextual Composition Frameworks
نویسنده
چکیده
vii Acknowledgementsix List of Publicationsx
منابع مشابه
Removing Redundant Boundary Checks in Contextual Composition Frameworks
Currently, contextual component frameworks, such as Enterprise JavaBeans (EJB), provide for application modularity at the cost of reduced performance. This “endemic” is partly due to the fairly liberal execution of platform code at component boundaries. The task of such code is to satisfy boundary conditions that components have specified at deployment time. In some cases, the execution of this...
متن کاملAutomatically Optimizing Context Management in Contextual Composition Frameworks
I propose an automatic solution for optimizing contextual composition frameworks by removing redundant context checks. By applying the results of my research, it is possible to build contextual composition platforms where modular applications do not incur runtime penalties due to the redundant execution of services at components’ boundaries.
متن کاملMultifractal Analysis for Conformal Graph Directed Markov Systems
Abstract. We derive the multifractal analysis of the conformal measure (or equivalently, the invariant measure) associated to a family of weights imposed upon a (multi-dimensional) graph directed Markov system (GDMS) using balls as the filtration. This analysis is done over a subset of J which is often large. In particular, it coincides with the limit set when the GDMS under scrutiny satisfies ...
متن کاملInterprocedural Array Data Flow Analysis for Cache Coherence
The presence of procedures and procedure calls introduces side eeects, which complicate the analysis of stale reference detection in compiler-directed cache coherence schemes 4, 3, 9]. Previous compiler algorithms use the invalidation of an entire cache at procedure boundary 5, 8] or inlining 8] to avoid reference marking interprocedurally. However, frequent cache invalidations will result in p...
متن کاملAverroes: Whole-Program Analysis without the Whole Program
Call graph construction for object-oriented programs is often difficult and expensive. Most sound and precise algorithms analyze the whole program including all library dependencies. The separate compilation assumption makes it possible to generate sound and reasonably precise call graphs without analyzing libraries. We investigate whether the separate compilation assumption can be encoded univ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007